- predicate with free variable
- предикат со свободной переменной
The New English-Russian Dictionary of Radio-electronics. F.V Lisovsky . 2005.
predicate with free variable
Смотреть что такое "predicate with free variable" в других словарях:
Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… … Wikipedia
Predicate variable — In first order logic, a predicate variable is a predicate letter which can stand for a relation (between terms) but which has not been specifically assigned any particular relation (or meaning). In first order logic (FOL) they can be more… … Wikipedia
Free variables and bound variables — In mathematics, and in other disciplines involving formal languages, including mathematical logic and computer science, a free variable is a notation that specifies places in an expression where substitution may take place. The idea is related to … Wikipedia
Free logic — is a logic with no existential presuppositions. Alternatively, it is a logic whose theorems are valid in all domains, including the empty domain. Explanation In classical logic there are theorems which clearly presuppose that there is something… … Wikipedia
Syntactic predicate — A syntactic predicate specifies the syntactic validity of applying a production in a formal grammar and is analogous to a semantic predicate that specifies the semantic validity of applying a production. It is a simple and effective means of… … Wikipedia
Functional predicate — In formal logic and related branches of mathematics, a functional predicate, or function symbol, is a logical symbol that may be applied to an object term to produce another object term.Functional predicates are also sometimes called mappings ,… … Wikipedia
bound variable — A variable x is bound in a formula if it is within the scope of a quantifier (in first order logic, (∀x ) or (∃x )). Intuitively this means that as the formula is evaluated and x in this occurrence is assigned to an object, the quantified… … Philosophy dictionary
List of Latin words with English derivatives — This is a list of Latin words with derivatives in English (and other modern languages). Ancient orthography did not distinguish between i and j or between u and v. Many modern works distinguish u from v but not i from j. In this article both… … Wikipedia
Generalization (logic) — Generalization is an inference rule of predicate calculus which states that:: If vdash P(x) is true (valid) then so is vdash forall x , P(x) . Generalization can be abbreviated as GEN. The inference rule can be summarized as the sequent: P(x)… … Wikipedia
First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… … Wikipedia
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
